Finding the K shortest hyperpaths using reoptimization

The shortest hyperpath problem is an extension of the classical shortest path problem and has applications in many different areas. Recently, algorithms for finding the K shortest hyperpaths in a directed hypergraph have been developed by Andersen, Nielsen and Pretolani. In this paper we improve the worst-case computational complexity of an algorithm for finding the K shortest hyperpaths in an acyclic hypergraph. This result is obtained by applying new reoptimization techniques for shortest hyperpaths. The algorithm turns out to be quite effective in practice and has already been successfully applied in the context of stochastic time-dependent networks, for finding the K best strategies and for solving bicriterion problems.Network programming; Directed hypergraphs; K shortest hyperpaths; K shortest paths

K shortest paths in stochastic time-dependent networks

A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent. More recently, a growing interest has been attracted by networks that are both stochastic and time-dependent. In these networks, the best route choice is not necessarily a path, but rather a time-adaptive strategy that assigns successors to nodes as a function of time. In some particular cases, the shortest origin-destination path must nevertheless be chosen a priori, since time-adaptive choices are not allowed. Unfortunately, finding the a priori shortest path is NP-hard, while the best time-adaptive strategy can be found in polynomial time. In this paper, we propose a solution method for the a priori shortest path problem, and we show that it can be easily adapted to the ranking of the first K shortest paths. Moreover, we present a computational comparison of time-adaptive and a priori route choices, pointing out the effect of travel time and cost distributions. The reported results show that, under realistic distributions, our solution methods are effectiveShortest paths; K shortest paths; stochastic time-dependent networks; routing; directed hypergraphs

A note on “Multicriteria adaptive paths in stochastic, time-varying networks”

In a recent paper, Opasanon and Miller-Hooks study multicriteria adaptive paths in stochastic time-varying networks. They propose a label correcting algorithm for finding the full set of efficient strategies. In this note we show that their algorithm is not correct, since it is based on a property that does not hold in general. Opasanon and Miller-Hooks also propose an algorithm for solving a parametric problem. We give a simplified algorithm which is linear in the input size.Multiple objective programming; shortest paths; stochastic time-dependent networks; time-adaptive strategies

Bicriterion a priori route choice in stochastic time-dependent networks.

In recent years there has been a growing interest in using stochastic time-dependent (STD) networks as a modelling tool for a number of applications within such areas as transportation and telecommunications. It is known that an optimal routing policy does not necessarily correspond to a path, but rather to a time-adaptive strategy. In some applications, however, it makes good sense to require that the routing policy corresponds to a loopless path in the network, that is, the time-adaptive aspect disappears and a priori route choice is considered. In this paper we consider bicriterion a priori route choice in STD networks, i.e. the problem of finding the set of efficient paths. Both expectation and min-max criteria are considered and a solution method based on the two-phase approach is devised. Experimental results reveal that the full set of efficient solutions can be determined on rather large test instances, which is in contrast to previously reported results for the time-adaptive caseStochastic time-dependent networks; Bicriterion shortest path; A priori route choice; Two-phase method

Ranking paths in stochastic time-dependent networks

In this paper we address optimal routing problems in networks where travel times are both stochastic and time-dependent. In these networks, the best route choice is not necessarily a path, but rather a "time-adaptive strategy" that assigns successors to nodes as a function of time. Nevertheless, in some particular cases an origin-destination path must be chosen "a priori", since time-adaptive choices are not allowed. Unfortunately, finding the a priori shortest path is an NP-hard problem. In this paper, we propose a solution method for the a priori shortest path problem, and we show that it can be easily extended to the ranking of the first K shortest paths. Our method exploits the solution of the time-adaptive routing problem as a relaxation of the a priori problem. Computational results are presented showing that, under realistic distributions of travel times and costs, our solution methods are effective and robust

A Methodological Demonstration of Set-Theoretical Approach to Social Media Maturity Models Using Necessary Condition Analysis

Despite being widely accepted and applied across research domains, maturity models have been criticized for lacking academic rigor, especially methodologically rigorous and empirically grounded or tested maturity models are quite rare. Attempting to close this gap, we adopt a set-theoretic approach by applying the Necessary Condition Analysis (NCA) technique to derive maturity stages and stage boundaries conditions. The ontology is to view stages (boundaries) in maturity models as a collection of necessary condition. Using social media maturity data, we demonstrate the strength of our approach and evaluate some of arguments presented by previous conceptual focused social media maturity models

Maturity Models Development in IS Research: A Literature Review

Maturity models are widespread in IS research and in particular, IT practitioner communities. However, theoretically sound, methodologically rigorous and empirically validated maturity models are quite rare. This literature review paper focuses on the challenges faced during the development of maturity models. Specifically, it explores maturity models literature in IS and standard guidelines, if any to develop maturity models, challenges identified and solutions proposed. Our systematic literature review of IS publications revealed over hundred and fifty articles on maturity models. Extant literature reveals that researchers have primarily focused on developing new maturity models pertaining to domain-specific problems and/or new enterprise technologies. We find rampant re-use of the design structure of widely adopted models such as Nolan’s Stage of Growth Model, Crosby’s Grid, and Capability Maturity Model (CMM). Only recently have there been some research efforts to standardize maturity model development. We also identify three dominant views of maturity models and provide guidelines for various approaches of constructing maturity models with a standard vocabulary. We finally propose using process theories and configurational approaches to address the main theoretical criticisms with regard to maturity models and conclude with some recommendations for maturity model developers

Distribution of cholinergic nerve terminals in the aged human brain measured with [18F]FEOBV PET and its correlation with histological data

Introduction: [18F]fluoroetoxybenzovesamicol ([18F]FEOBV) is a positron emission topography (PET) tracer for the vesicular acetylcholine transporter (VAChT), a protein located predominantly in synaptic vesicles in cholinergic nerve terminals. We aimed to use [18F]FEOBV PET to study the cholinergic topography of the healthy human brain. Materials and methods: [18F]FEOBV PET brain data volumes of healthy elderly humans were normalized to standard space and intensity-normalized to the white matter. Stereotactic atlases of regions of interest were superimposed to describe and quantify tracer distribution. The spatial distribution of [18F]FEOBV PET uptake was compared with histological and gene expression data. Results: Twenty participants of both sexes and a mean age of 73.9 ± 6.0 years, age-range [64; 86], were recruited. Highest tracer binding was present in the striatum, some thalamic nuclei, and the basal forebrain. Intermediate binding was found in most nuclei of the brainstem, thalamus, and hypothalamus; the vermis and flocculonodular lobe; and the hippocampus, amygdala, insula, cingulate, olfactory cortex, and Heschl's gyrus. Lowest binding was present in most areas of the cerebral cortex, and in the cerebellar nuclei and hemispheres. The spatial distribution of tracer correlated with immunohistochemical post-mortem data, as well as with regional expression levels of SLC18A3, the VAChT coding gene. Discussion: Our in vivo findings confirm the regional cholinergic distribution in specific brain structures as described post-mortem. A positive spatial correlation between tracer distribution and regional gene expression levels further corroborates [18F]FEOBV PET as a validated tool for in vivo cholinergic imaging. The study represents an advancement in the continued efforts to delineate the spatial topography of the human cholinergic system in vivo